A space-filling curve

ثبت نشده
چکیده

In mathematics classes where the natural numbers are studied, several surprising results can be shown about the relative “sizes” of infinite sets, such as the fact the there is a oneto-one mapping between the natural numbers N and the even numbers, showing that they are both countably infinite, with the “same size”. Similar logic also shows that there is a mapping from the natural numbers N onto the product space N×N of all pairs of natural numbers. When dealing with real numbers, it should therefore be somewhat expected that there is a mapping from the unit interval [0, 1] onto the unit square [0, 1]2. However, what is surprising is that there continuous mappings of this form. These are frequently referred to as space-filling curves, or Peano curves, after the Italian mathematician Giuseppe Peano (1858–1932). Here, a specific space-filling curve due to Schoenberg [1] is described. As can been seen in the graphs below, this curve has a complex and overlapping structure, and it is possible to construct curves with a much more regular structure. However, the curve by Schoenberg has the advantage of being relatively straightforward to analyze. To begin, a continuous function f : R → [0, 1] is introduced, which is even and is periodic with period 2, so that f (x) = f (x + 2) for all x. On the interval from [0, 1],

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves

This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...

متن کامل

A Optimality of Clustering Properties of Space Filling Curves

Space filling curves have been used in the design of data structures for multidimensional data since many decades. A fundamental quality metric of a space filling curve is its “clustering number” with respect to a class of queries, which is the average number of contiguous segments on the space filling curve that a query region can be partitioned into. We present a characterization of the clust...

متن کامل

On the metric properties of discrete space-filling curves

A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the curve should preserve "locality". We quantify "locality" and bound the locality of multidimensional space-filling curves. Classic Hilbert space-filling curves come close to achieving optimal locality.

متن کامل

An inventory of three-dimensional Hilbert space-filling curves

Hilbert’s two-dimensional space-filling curve is appreciated for its good locality properties for many applications. However, it is not clear what is the best way to generalize this curve to filling higher-dimensional spaces. We argue that the properties that make Hilbert’s curve unique in two dimensions, are shared by 10 694 807 structurally different space-filling curves in three dimensions. ...

متن کامل

Digital halftoning algorithm based on random space-filling curve

SUMMARY This letter introduces a new digital halftoning technique based on error diffusion along a random space-filling curve. The purpose of introducing randomness is to erase regular patterns which tend to arise in an image area of uniform intensity. A simple algorithm for generating a random space-filling curve is proposed based on a random spanning tree and maze traversal. Some experimental...

متن کامل

Algebraic Formulation and Program Generation of Three-Dimensional Hilbert Space-Filling Curves

We use a tensor product based multi-linear algebra theory to formulate three-dimensional Hilbert space-filling curves. A 3-D Hilbert space-filling curve is specified as a permutation which rearranges threedimensional n n n data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing a 3-D Hilbert space-filling curve. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014